Supporting Range Queries on Web Data Using k-Nearest Neighbor Search

Access to a large volume of publicly available geospatial data on the web is hindered due to their restricted web interfaces. A typical scenario is the existence of numerous business web sites that provide the address of their branch locations through a limited “nearest location” web interface. For example, a chain restaurant’s web site such as McDonalds can be queried to find some of the closest locations of its branches to the user’s home address. However, even though the site has the location data of all restaurants in, for example, the state of California, the provided web interface makes it very difficult to retrieve this data set. We conceptualize this problem as a more general problem of running spatial range queries by utilizing only k-Nearest Neighbor (k-NN) searches. Subsequently, we propose two algorithms to cover the rectangular shape of the spatial range query with as few k-NN searches as possible. Finally, we evaluate the efficiency of our algorithms through empirical experiments.